Normalization for the Simply-Typed Lambda-Calculus in Twelf
نویسنده
چکیده
Normalization for the simply-typed λ-calculus is proven in Twelf, an implementation of the Edinburgh Logical Framework. Since due to proof-theoretical restrictions Twelf Tait’s computability method does not seem to be directly usable, a syntactical proof is adapted and formalized instead. In this case study, some boundaries of Twelf current capabilities are touched and discussed.
منابع مشابه
Weak Normalization for the Simply-Typed Lambda-Calculus in Twelf
Weak normalization for the simply-typed λ-calculus is proven in Twelf, an implementation of the Edinburgh Logical Framework. Since due to proof-theoretical restrictions Twelf Tait’s computability method does not seem to be directly usable, a combinatorical proof is adapted and formalized instead.
متن کاملFourth International Workshop on Logical Frameworks and Meta-Languages (LFM’04)
Weak normalization for the simply-typed λ-calculus is proven in Twelf, an implementation of the Edinburgh Logical Framework. Since due to proof-theoretical restrictions Twelf Tait’s computability method does not seem to be directly usable, a combinatorical proof is adapted and formalized instead.
متن کاملA Lambda Prolog Based Animation of Twelf Specifications
Specifications in the Twelf system are based on a logic programming interpretation of the Edinburgh Logical Framework or LF. We consider an approach to animating such specifications using a λProlog implementation. This approach is based on a lossy translation of the dependently typed LF expressions into the simply typed lambda calculus (STLC) terms of λProlog and a subsequent encoding of lost d...
متن کاملEmbedding developments into simply typed -calculus
By using an infinity of extra variables every λ-term with indexed redexes is interpreted into a term in the simply typed lambda calculus à la Curry. A development becomes a usual β-reduction in the simply typed lambda calculus and the corresponding properties of developments come out from the corresponding properties (strong normalization and Church-Rosser) holding in this system. In this way w...
متن کاملMechanizing metatheory in a logical framework
The LF logical framework codifies a methodology for representing deductive systems, such as programming languages and logics, within a dependently typed λ-calculus. In this methodology, the syntactic and deductive apparatus of a system is encoded as the canonical forms of associated LF types; an encoding is correct (adequate) if and only if it defines a compositional bijection between the appar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. Notes Theor. Comput. Sci.
دوره 199 شماره
صفحات -
تاریخ انتشار 2008